Minimum Cuts of A Time-Varying Background
نویسندگان
چکیده
Motivated by the demand for an effective background model, robust to non-stationary environmental changes in outdoor scenes, we present a technique using Combinatorial Optimization to extract near-optimal background estimates from blocks of temporally localized frames. Using an existing graph cut technique in conjunction with subspace analysis, we demonstrate a novel background model exhibiting results superior to those achievable with the latter technique alone, and especially suitable for background modelling in outdoor situations where variable lighting conditions prevail.
منابع مشابه
A near-linear time algorithm for constructing a cactus representation of minimum cuts
We present an Õ(m) (near-linear) time Monte Carlo algorithm for constructing the cactus data structure, a useful representation of all the global minimum edge cuts of an undirected graph. Our algorithm represents a fundamental improvement over the best previous (quadratic time) algorithms: because there can be quadratically many min-cuts, our algorithm must avoid looking at all min-cuts during ...
متن کاملContiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs
We present a fast algorithm for uniform sampling of contiguous minimum cuts separating a source vertex from a set of sink vertices in a weighted undirected planar graph with n vertices embedded in the plane. The algorithm takes O(n) time per sample, after an initial O(n) preprocessing time during which the algorithm computes the number of all such contiguous minimum cuts. Contiguous cuts (that ...
متن کاملBuilding Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
A cactus is a simple data structure that represents all minimum cuts of a weighted, undi-rected graph in linear space. We describe the rst algorithm that can build a cactus from the asymptotically fastest deterministic algorithm that nds all minimum cuts in a weighted graph | the Hao-Orlin minimum cut algorithm. This improves the time to construct the cactus in graphs with n vertices and m edge...
متن کاملPotentials of Evolving Linear Models in Tracking Control Design for Nonlinear Variable Structure Systems
Evolving models have found applications in many real world systems. In this paper, potentials of the Evolving Linear Models (ELMs) in tracking control design for nonlinear variable structure systems are introduced. At first, an ELM is introduced as a dynamic single input, single output (SISO) linear model whose parameters as well as dynamic orders of input and output signals can change through ...
متن کاملMost balanced minimum cuts and partially ordered knapsack
We consider the problem of finding most balanced cuts among minimum st-edge cuts and minimum st-vertex cuts, for given vertices s and t, according to different balance criteria. For edge cuts [S, S] we seek to maximize min{|S|, |S|}. For vertex cuts C of G we consider the objectives of (i) maximizing min{|S|, |T |}, where {S, T} is a partition of V (G)\C with s ∈ S, t ∈ T and [S, T ] = ∅, (ii) ...
متن کامل